A Hierarchy of Modal Event Calculi: Expressiveness and Complexity
نویسندگان
چکیده
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergot’s Event Calculus (EC ): given a set of event occurrences, EC allows the derivation of the maximal validity intervals (MVIs) over which properties initiated or terminated by those events hold. The formalisms we analyze extend EC with operators from modal logic. They range from the basic Modal Event Calculus (MEC ), that computes the set of all current MVIs (MVIs computed by EC ) as well as the sets of MVIs that are true in some/every refinement of the current partial ordering of events (3-/2-MVIs), to the Generalized Modal Event Calculus (GMEC ), that extends MEC by allowing a free mix of boolean connectives and modal operators. We analyze and compare the expressive power and the complexity of the proposed calculi, focusing on intermediate systems between MEC and GMEC. We motivate the discussion by using a fault diagnosis problem as a case
منابع مشابه
Modal Event Calculi with Preconditions
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) over which properties initiated or terminated by those events hold. The limited expressive power of EC is notably augmented by permitting events to initiate or terminate a property only if a given set of preconditions hol...
متن کاملThe Complexity of Model Checking in Modal Event Calculi with Quantifiers
Kowalski and Sergot’s Event Calculus (EC ) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. It does so in polynomial time with respect to the number of events. Extensions of its query language with Boolean connectives and operators from modal logic have been sh...
متن کاملA Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot’s Event Calculus (EC ) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. In this paper, we conduct a systematic analysis of EC by which we gain a better understanding of this formalism and determine ways of augmenting its expressive power. Th...
متن کاملLinkk Oping Electronic Articles in the Complexity of Model Checking in Modal Event Calculi with Quantiiers Linkk Oping Electronic Articles in Computer and Information Science
Kowalski and Sergot s Event Calculus EC is a simple tempo ral formalism that given a set of event occurrences derives the maximal validity intervals MVIs over which properties initi ated or terminated by these events hold It does so in polyno mial time with respect to the number of events Extensions of its query language with Boolean connectives and operators from modal logic have been shown to...
متن کاملThe Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism designed to model situations characterized by a set of events whose occurrences have the effect of starting or terminating the validity of determined properties. EC is able to determine the maximal validity intervals (MVIs) over which a property holds uninterruptedly. The algorithm EC relies on for the verification of MVIs...
متن کامل